منابع مشابه
A Discrete Adjoint Model for OpenFOAM
We present a discrete adjoint version of OpenFOAM obtained by operator overloading which yields, in comparison to continuous adjoint versions, a greater flexibility and robustness. We discuss our implementation and how the discrete adjoint version of OpenFOAM differs from existing continuous implementations. To reduce the inherent memory requirement of discrete adjoint code we introduce a check...
متن کاملA Discrete Adjoint Version of an Unsteady Incompressible Solver for Openfoam Using Algorithmic Differentiation
The comparatively low computational costs of adjoint based gradient methods for optimization problems with a high number of degrees of freedom have allowed them to become one of the most interesting approaches in CFD shape optimization. At the core of such optimization techniques lies the computation of topology sensitivity maps. The two most common approaches for computing adjoint based sensit...
متن کاملOMPARISON OF DISCRETE FORWARD AND ADJOINT METHOD Forward Adjoint
Sensitivity analysis is an important tool for describing power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitiv...
متن کاملParallel Evolutionary Algorithms on Mpi
Parallel Evolutionary algorithms have been developed to reduce the running time of serial Evolutionary algorithms. Two major paradigms for parallel programming, Message Passing and Shared Memory, are implemented and their performance observed. Message Passing Interface (MPI) and TreadMarks runtime libraries are chosen to implement parallel Evolutionary algorithms, based on a synchronous master-...
متن کاملParallel Gaussian Elimination Using MPI
In this project, we had to implement a parallel solver for linear equation systems, using a technique known as Gaussian elimination (GE). As with many other algorithms for solving linear equation systems, GE is performed on the matrix representation of the system, Ax = b, where A is the coefficient matrix and b is the vector of known values. GE works by applying a set of elementary row operatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2015
ISSN: 1877-0509
DOI: 10.1016/j.procs.2015.05.181